Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
نویسندگان
چکیده
منابع مشابه
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
Two important performance parameters of distributed, rate-based flow control algorithms are their locality and convergence complexity. The former is characterized by the amount of global knowledge that is available to their scheduling mechanisms, while the latter is defined as the number of update operations performed on rates of individual sessions until max-min fairness is reached. Optimistic...
متن کاملConvergence Complexity of Optimistic Rate-Based Flow-Control Algorithms
This paper studies basic properties of rate-based flow-control algorithms and of the max-min fairness criteria. For the algorithms we suggest a new approach for their modeling and analysis, which may be considered more ‘‘optimistic’’ and realistic than traditional approaches. Three variations of the approach are presented, and their rate of convergence to the optimal max-min fairness solution i...
متن کاملFast Admission Control for Rate Monotonic Schedulers
Rate monotonic traffic scheduling algorithm had been shown [1] to be the optimal static priority assignment scheme. The system model studied in [1] can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at ...
متن کاملOptimistic Fair Priced Oblivious Transfer
Priced oblivious transfer (POT) is a two-party protocol between a vendor and a buyer in which the buyer purchases digital goods without the vendor learning what is bought. Although privacy properties are guaranteed, current schemes do not offer fair exchange. A malicious vendor can, e.g., prevent the buyer from retrieving the goods after receiving the payment, and a malicious buyer can also acc...
متن کاملRate-Based Flow Control
On high-speed networks, the round trip delay from source to intermediate node and back is relatively large compared with packet transmission times; thus, the window-based method of flow control does not react quickly enough to prevent congestion and large delay. An alternative method is to employ a rate-based flow control scheme, in which each node is assigned a maximum rate and an average rate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2005
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s009753970343275x